Generative Adversarial Networks (GANs)

نویسندگان

چکیده

Generative Adversarial Networks (GANs) is a novel class of deep generative models that has recently gained significant attention. GANs learn complex and high-dimensional distributions implicitly over images, audio, data. However, there exist major challenges in training GANs, i.e., mode collapse, non-convergence, instability, due to inappropriate design network architectre, use objective function, selection optimization algorithm. Recently, address these challenges, several solutions for better have been investigated based on techniques re-engineered architectures, new functions, alternative algorithms. To the best our knowledge, no existing survey particularly focused broad systematic developments solutions. In this study, we perform comprehensive advancements proposed handle challenges. We first identify key research issues within each technique then propose taxonomy structure by issues. accordance with taxonomy, provide detailed discussion different variants solution their relationships. Finally, insights gained, present promising directions rapidly growing field.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attention-Aware Generative Adversarial Networks (ATA-GANs)

In this work, we present a novel approach for training Generative Adversarial Networks (GANs). Using the attention maps produced by a TeacherNetwork we are able to improve the quality of the generated images as well as perform weakly object localization on the generated images. To this end, we generate images of HEp-2 cells captured with Indirect Imunofluoresence (IIF) and study the ability of ...

متن کامل

GANs for LIFE: Generative Adversarial Networks for Likelihood Free Inference

We introduce a framework using Generative Adversarial Networks (GANs) for likelihood–free inference (LFI) and Approximate Bayesian Computation (ABC). Our approach addresses both the key problems in likelihood–free inference, namely how to compare distributions and how to efficiently explore the parameter space. Our framework allows one to use the simulator model as a black box and leverage the ...

متن کامل

Gang of GANs: Generative Adversarial Networks with Maximum Margin Ranking

Traditional generative adversarial networks (GAN) and many of its variants are trained by minimizing the KL or JS-divergence loss that measures how close the generated data distribution is from the true data distribution. A recent advance called the WGAN based on Wasserstein distance can improve on the KL and JS-divergence based GANs, and alleviate the gradient vanishing, instability, and mode ...

متن کامل

Automatic Colorization of Grayscale Images Using Generative Adversarial Networks

Automatic colorization of gray scale images poses a unique challenge in Information Retrieval. The goal of this field is to colorize images which have lost some color channels (such as the RGB channels or the AB channels in the LAB color space) while only having the brightness channel available, which is usually the case in a vast array of old photos and portraits. Having the ability to coloriz...

متن کامل

Generalization and Equilibrium in Generative Adversarial Nets (GANs)

Generalization is defined training of generative adversarial network (GAN), and it’s shown that generalization is not guaranteed for the popular distances between distributions such as Jensen-Shannon or Wasserstein. In particular, training may appear to be successful and yet the trained distribution may be arbitrarily far from the target distribution in standard metrics. It is shown that genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Computing Surveys

سال: 2021

ISSN: ['0360-0300', '1557-7341']

DOI: https://doi.org/10.1145/3446374